On the Kronecker Product $s_{(n-p,p)}\ast s_{\lambda}$

Transformation of the Kronecker Product

Shifted Kronecker Product Systems

Abstract. A fast method for solving a linear system of the form (A(p) ⊗ · · · ⊗ A(1) − λI)x = b is given where each A(i) is an ni-by-ni matrix. The first step is to convert the problem to triangular form (T (p) ⊗ · · · ⊗ T (1) − λI)y = c by computing the (complex) Schur decompositions of the A(i). This is followed by a recursive back-substitution process that fully exploits the Kronecker struct...

On the diameter of the Kronecker product graph

Let and be two undirected nontrivial graphs. The Kronecker product of and denoted by with vertex set , two vertices and are adjacent if and only if and . This paper presents a formula for computing the diameter of by means of the diameters and primitive exponents of factor graphs.

Block Kronecker Product Graph Model

Since Kronecker Product Graph Model (KPGM) was introduced, it has been widely used to model real networks. The characteristics of the model specially its single fractal structure have made KPGM one of the most important algorithm of the last years. However, the utilization of a single fractal structure decreases the potential of KPGM by limiting the graph space covered by the model. In this pap...

On the Kronecker Product s(n-p,p) * sλ

The Kronecker product of two Schur functions s λ and s µ , denoted s λ * s µ , is defined as the Frobenius characteristic of the tensor product of the irreducible representations of the symmetric group indexed by partitions of n, λ and µ, respectively. The coefficient, g λ,µ,ν , of s ν in s λ * s µ is equal to the multiplicity of the irreducible representation indexed by ν in the tensor product...